Encoding second order string ACG with deterministic tree walking transducers
نویسنده
چکیده
In this paper we study the class of string languages represented by second order Abstract Categorial Grammar. We prove that this class is the same as the class of output languages of determistic tree walking automata. Together with the result of de Groote and Pogodalla (2004) this shows that the higher-order operations involved in the definition of second order ACGs can always be represented by operations that are at most fourth order.
منابع مشابه
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
I n t r o d u c t i o n In [9] a comparison was made of the generative capacity of a number of grammar formalisms. Several were found to share a number of characteristics (described below) and the class of such formalisms was called linear context-free rewriting systems. This paper shows how the class of string languages generated by linear context-free rewriting systems relates to a number of ...
متن کاملString Languages Generated by Total Deterministic Macro Tree Transducers
The class of string languages obtained by taking the yields of output tree languages of total deterministic macro tree transducers (MTTs) is investigated. The rst main result is that MTTs which are linear and nondeleting in the parameters generate the same class of string languages as total deterministic top-down tree transducers. The second main result is a so called \bridge theorem"; it can b...
متن کاملInternship report - Streaming String Transducers
In formal language theory, two very different models sometimes turn out to describe the same class of languages. This usually shows that there is a fundamental concept described by those models. A well-known example is the class of regular languages, which can be characterized by logic (monadic second order (MSO) logic), algebra (syntactic monoids), and many computational models (automata). In ...
متن کاملDecision Problems of Tree Transducers with Origin
A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence o...
متن کاملDomains of partial attributed tree transducers
The domains of partial attributed tree transducers (patt’s) are the tree languages recognized by tree walking automata in universal acceptance mode. Moreover, the domains of patt’s having monadic output are the tree languages recognized by deterministic tree walking automata. 2000 Elsevier Science B.V. All rights reserved.
متن کامل